Submodularity of minimum-cost spanning tree games
نویسندگان
چکیده
We give a necessary condition and a sufficient condition for a minimum-cost spanning tree game introduced by Bird to be submodular (or convex). When the cost is restricted to two values, we give a characterization of submodular minimum-cost spanning tree games. We also discuss algorithmic issues.
منابع مشابه
A Metaheuristic Algorithm for the Minimum Routing Cost Spanning Tree Problem
The routing cost of a spanning tree in a weighted and connected graph is defined as the total length of paths between all pairs of vertices. The objective of the minimum routing cost spanning tree problem is to find a spanning tree such that its routing cost is minimum. This is an NP-Hard problem that we present a GRASP with path-relinking metaheuristic algorithm for it. GRASP is a multi-start ...
متن کاملReduction of Ultrametric Minimum Cost Spanning Tree Games to Cost Allocation Games on Rooted Trees
A minimum cost spanning tree game is called ultrametric if the cost function on the edges of the underlying network is an ultrametric. We show that every ultrametric minimum cost spanning tree game is reduced to a cost allocation game on a rooted tree. It follows that there exist O(n) time algorithms for computing the Shapley value, the nucleolus and the egalitarian allocation of the ultrametri...
متن کاملRIMS-1674 Reduction of Ultrametric Minimum Cost Spanning Tree Games to Cost Allocation Games on Rooted Trees By
A minimum cost spanning tree game is called ultrametric if the cost function on the edges of the underlying network is ultrametric. We show that every ultrametric minimum cost spanning tree game is a cost allocation game on a rooted tree. It follows that there exist optimal algorithms for computing the Shapley value, the nucleolus and the egalitarian allocation of the ultrametric minimum cost s...
متن کاملCost monotonicity, consistency and minimum cost spanning tree games
We propose a new cost allocation rule for minimum cost spanning tree games. The new rule is a core selection and also satis...es cost monotonicity. We also give characterization theorems for the new rule as well as the much-studied Bird allocation. We show that the principal di¤erence between these two rules is in terms of their consistency properties. JEL Classi...cation Numbers: D7
متن کاملNote on the computational complexity of least core concepts for min-cost spanning tree games
Various least core concepts including the classical least core of cooperative games are discussed. By a reduction from minimum cover problems, we prove that computing an element in these least cores is in general N P-hard for minimum cost spannning tree games. As a consequence, computing the nucleolus, the nucleon and the per-capita nucleolus of minimum cost spanning tree games is also N P-hard.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Networks
دوره 63 شماره
صفحات -
تاریخ انتشار 2014